Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

f1(X) -> cons2(X, n__f1(g1(X)))
g1(0) -> s1(0)
g1(s1(X)) -> s1(s1(g1(X)))
sel2(0, cons2(X, Y)) -> X
sel2(s1(X), cons2(Y, Z)) -> sel2(X, activate1(Z))
f1(X) -> n__f1(X)
activate1(n__f1(X)) -> f1(X)
activate1(X) -> X

Q is empty.


↳ QTRS
  ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

f1(X) -> cons2(X, n__f1(g1(X)))
g1(0) -> s1(0)
g1(s1(X)) -> s1(s1(g1(X)))
sel2(0, cons2(X, Y)) -> X
sel2(s1(X), cons2(Y, Z)) -> sel2(X, activate1(Z))
f1(X) -> n__f1(X)
activate1(n__f1(X)) -> f1(X)
activate1(X) -> X

Q is empty.

Using Dependency Pairs [1,13] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

SEL2(s1(X), cons2(Y, Z)) -> ACTIVATE1(Z)
SEL2(s1(X), cons2(Y, Z)) -> SEL2(X, activate1(Z))
F1(X) -> G1(X)
ACTIVATE1(n__f1(X)) -> F1(X)
G1(s1(X)) -> G1(X)

The TRS R consists of the following rules:

f1(X) -> cons2(X, n__f1(g1(X)))
g1(0) -> s1(0)
g1(s1(X)) -> s1(s1(g1(X)))
sel2(0, cons2(X, Y)) -> X
sel2(s1(X), cons2(Y, Z)) -> sel2(X, activate1(Z))
f1(X) -> n__f1(X)
activate1(n__f1(X)) -> f1(X)
activate1(X) -> X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

SEL2(s1(X), cons2(Y, Z)) -> ACTIVATE1(Z)
SEL2(s1(X), cons2(Y, Z)) -> SEL2(X, activate1(Z))
F1(X) -> G1(X)
ACTIVATE1(n__f1(X)) -> F1(X)
G1(s1(X)) -> G1(X)

The TRS R consists of the following rules:

f1(X) -> cons2(X, n__f1(g1(X)))
g1(0) -> s1(0)
g1(s1(X)) -> s1(s1(g1(X)))
sel2(0, cons2(X, Y)) -> X
sel2(s1(X), cons2(Y, Z)) -> sel2(X, activate1(Z))
f1(X) -> n__f1(X)
activate1(n__f1(X)) -> f1(X)
activate1(X) -> X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [13,14,18] contains 2 SCCs with 3 less nodes.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ QDPOrderProof
          ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

G1(s1(X)) -> G1(X)

The TRS R consists of the following rules:

f1(X) -> cons2(X, n__f1(g1(X)))
g1(0) -> s1(0)
g1(s1(X)) -> s1(s1(g1(X)))
sel2(0, cons2(X, Y)) -> X
sel2(s1(X), cons2(Y, Z)) -> sel2(X, activate1(Z))
f1(X) -> n__f1(X)
activate1(n__f1(X)) -> f1(X)
activate1(X) -> X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be strictly oriented and are deleted.


G1(s1(X)) -> G1(X)
The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
G1(x1)  =  G1(x1)
s1(x1)  =  s1(x1)

Lexicographic Path Order [19].
Precedence:
s1 > G1

The following usable rules [14] were oriented: none



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ PisEmptyProof
          ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

f1(X) -> cons2(X, n__f1(g1(X)))
g1(0) -> s1(0)
g1(s1(X)) -> s1(s1(g1(X)))
sel2(0, cons2(X, Y)) -> X
sel2(s1(X), cons2(Y, Z)) -> sel2(X, activate1(Z))
f1(X) -> n__f1(X)
activate1(n__f1(X)) -> f1(X)
activate1(X) -> X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof

Q DP problem:
The TRS P consists of the following rules:

SEL2(s1(X), cons2(Y, Z)) -> SEL2(X, activate1(Z))

The TRS R consists of the following rules:

f1(X) -> cons2(X, n__f1(g1(X)))
g1(0) -> s1(0)
g1(s1(X)) -> s1(s1(g1(X)))
sel2(0, cons2(X, Y)) -> X
sel2(s1(X), cons2(Y, Z)) -> sel2(X, activate1(Z))
f1(X) -> n__f1(X)
activate1(n__f1(X)) -> f1(X)
activate1(X) -> X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [13].


The following pairs can be strictly oriented and are deleted.


SEL2(s1(X), cons2(Y, Z)) -> SEL2(X, activate1(Z))
The remaining pairs can at least by weakly be oriented.
none
Used ordering: Combined order from the following AFS and order.
SEL2(x1, x2)  =  x1
s1(x1)  =  s1(x1)
cons2(x1, x2)  =  x2
activate1(x1)  =  activate1(x1)
n__f1(x1)  =  x1
f1(x1)  =  f1(x1)
g1(x1)  =  g1(x1)
0  =  0

Lexicographic Path Order [19].
Precedence:
activate1 > f1 > g1 > s1
0 > s1

The following usable rules [14] were oriented:

activate1(n__f1(X)) -> f1(X)
activate1(X) -> X
f1(X) -> cons2(X, n__f1(g1(X)))
f1(X) -> n__f1(X)
g1(0) -> s1(0)
g1(s1(X)) -> s1(s1(g1(X)))



↳ QTRS
  ↳ DependencyPairsProof
    ↳ QDP
      ↳ DependencyGraphProof
        ↳ AND
          ↳ QDP
          ↳ QDP
            ↳ QDPOrderProof
              ↳ QDP
                ↳ PisEmptyProof

Q DP problem:
P is empty.
The TRS R consists of the following rules:

f1(X) -> cons2(X, n__f1(g1(X)))
g1(0) -> s1(0)
g1(s1(X)) -> s1(s1(g1(X)))
sel2(0, cons2(X, Y)) -> X
sel2(s1(X), cons2(Y, Z)) -> sel2(X, activate1(Z))
f1(X) -> n__f1(X)
activate1(n__f1(X)) -> f1(X)
activate1(X) -> X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.